Definability for Downward and Vertical XPath on Data Trees Sergio Abriola1 , Mar´ıa Emilia Descotte1 , and Santiago Figueira1,2 1 University of Buenos Aires, Argentina

Source URL: www.glyc.dc.uba.ar

• Metalogic
• Ultraproduct
• Sheaf
• First-order logic
• Model theory
• Mathematical logic
• Logic

On the Formal Semantics of IF-like Logics Santiago Figueira∗ Daniel Gor´ın∗ Rafael Grimson†

Source URL: www.glyc.dc.uba.ar

• Model theory
• Philosophical logic
• Semantics
• Non-classical logic
• First-order logic
• Interpretation
• Lambda calculus
• Independence-friendly logic
• FO
• Logic
• Mathematical logic
• Mathematics

Cut Elimination in Deduction Modulo by Abstract Completion Guillaume Burel1 and Claude Kirchner2 1 3

Source URL: www.ensiie.fr

• Natural deduction
• Sequent calculus
• Cut-elimination theorem
• Sequent
• Rule of inference
• First-order logic
• Mathematical proof
• KeY
• Negation
• Logic
• Mathematical logic
• Proof theory

Soundness of embeddings in the λΠ-calculus modulo rewriting Ali Assaf Deducteam, Inria Paris-Rocquencourt École Polytechnique

Source URL: who.rocq.inria.fr

• Logic
• Logic in computer science
• Dependently typed programming
• Lambda calculus
• Proof theory
• Curry–Howard correspondence
• First-order logic
• Logical framework
• System F
• Mathematical logic
• Theoretical computer science
• Type theory

Introduction 0-1 Law for Bernays-Sch¨ onfinkel Negative Results

Source URL: www.cs.technion.ac.il

• Mathematics
• Metalogic
• Formal languages
• First-order logic
• Predicate logic
• Boolean satisfiability problem
• Well-formed formula
• Satisfiability
• Second-order logic
• Logic
• Mathematical logic
• Model theory

A Variability-Based Approach to Reusable and Efficient Model Transformations Daniel Str¨uber1 , Julia Rubin2 , Marsha Chechik3 , and Gabriele Taentzer1 1 Philipps-Universit¨at Marburg, Germany

Source URL: people.csail.mit.edu

• Predicate logic
• Logic
• Graph rewriting
• Philosophical logic
• First-order logic
• Graph
• Quantification
• Planar graph
• FO
• Graph theory
• Mathematics
• Theoretical computer science

LOGIC & AUTOMATA — HOMEWORK 1 Due: Tuesday 2 February, 3pm Write first-order formulae defining the following regular languages over the alphabet Σ = {a, b}. 1. (a + b)+ · a 2. a∗ b∗

Source URL: homepages.inf.ed.ac.uk

Monodic Fragments of Probabilistic First-order Logic Jean Christoph Jung1 , Carsten Lutz1 , Sergey Goncharov2 , and Lutz Schr¨oder2 1 Universit¨at Bremen, {jeanjung,clu}@informatik.uni-bremen.de, 2

Source URL: www.informatik.uni-bremen.de

An ontology for quality management — enabling quality problem identification and tracing H M Kim, M S Fox and M Grüninger The TOVE Quality Ontology-VB is the formal representation (using First-order Logic) of terms, r

Source URL: www.eil.utoronto.ca

2004 Paper 5 Question 9 Logic and Proof In this question x, y, z are variables, and a, b, c are constants. (a) Briefly outline the semantics of first order logic.

Source URL: www.cl.cam.ac.uk